/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
    public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
        ListNode myHeadNode= new ListNode(-1);
        ListNode myNode = myHeadNode;
        while (l1!=null&&l2!=null){
            if (l1.val<l2.val){
                myNode.next=l1;
                l1=l1.next;
            }else {
                myNode.next=l2;
                l2=l2.next;
            }
            myNode =myNode.next;
        }

        myNode.next= l1==null ? l2:l1;
        return myHeadNode.next;

    }
}